/*
 * Copyright 2011 Fabian Wenzelmann
 * 
 * This file is part of Recognition-Procedures-for-Boolean-Functions.
 * 
 * Recognition-Procedures-for-Boolean-Functions is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Recognition-Procedures-for-Boolean-Functions is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Recognition-Procedures-for-Boolean-Functions.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.wenzelmf.booleanFunction.lpb.combinatorial.solver;

import de.wenzelmf.booleanFunction.lpb.combinatorial.splittingTree.SplittingTree;
import de.wenzelmf.booleanFunction.lpb.util.ConversionException;
import de.wenzelmf.booleanFunction.lpb.util.LPB;

/**
 * This interface just provides a method to convert a SplittingTree to a LPB.
 * 
 * @author Fabian Wenzelmann
 * @version 1.0
 *
 */
public interface TreeToLPB
{
	
	/**
	 * Generates a  DNF from a splitting tree.
	 * 
	 * @param t The splitting tree generated from the original DNF (you may assume that the
	 * {@code createTree} method has been called on the tree).
	 * 
	 * @return A LPB representing the original DNF (the root node's DNF).
	 * 
	 * @throws ConversionException If it is not possible to generate a LPB from the tree.
	 */
	public LPB solve(SplittingTree t) throws ConversionException;
	
}
